#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
int a[N];
map<int, int>mp;
int n;
void fun(int x)
{
	//10
	for (int i = 1; i <= x / i; i++) {
		if (x % i == 0) {
			a[x]++;
			if (i != x / i) {
				a[x]++;
			}
		}
	}
}

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++) {
		fun(i);
	}
	//cout << a[10] << endl;
	LL ans = 0;
	for (int i = 1; i <= n; i++) {
		//cout << "i==" << i << endl;
		//cout << "a[i]==" << a[i] << endl;
		//cout << "a[n-i]==" << a[n - i] << endl;
		ans += a[i] * a[n - i];
	}
	cout << ans << endl;
	return 0;
}
